Robust Scheduling for Queueing Networks
نویسنده
چکیده
Robust Scheduling for Queueing Networks
منابع مشابه
Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling
We consider the stability of robust scheduling policies for multiclass queueing networks. These are open networks with arbitrary routing matrix and several disjoint groups of queues in which at most one queue can be served at a time. The arrival and potential service processes and routing decisions at the queues are independent, stationary and ergodic. A scheduling policy is called robust if it...
متن کاملInstability Phenomena in Underloaded Packet Networks with QoS Schedulers
Instability in packet networks is normally associated with overload conditions, since queueing network models show that, in simple configurations, only overload generates instability. However, some results showing that instability can happen also in underloaded queueing networks appeared in the literature. Underload instabilities can be produced either by customer routes that visit several time...
متن کاملRobust Scheduling for Flexible Processing Networks
Modern processing networks often consist of heterogeneous servers with widely varying capabilities, and process job flows with complex structure and requirements. A major challenge in designing efficient scheduling policies in these networks is the lack of reliable estimates of system parameters, and an attractive approach for addressing this challenge is to design robust policies, i.e., polici...
متن کاملPerformance evaluation of scheduling control of queueing networks: Fluid model heuristics
Motivated by dynamic scheduling control for queueing networks, Chen and Yao 8] developed a systematic method to generate dynamic scheduling control policies for a uid network, a simple and highly aggregated model that approximates the queueing network. This study addresses the question of how good these uid policies are as heuristic scheduling policies for queueing networks. Using simulation on...
متن کاملDesign and Evaluation of a Weighted Sacrificing Fair Queueing Algorithm for Wireless Packet Networks
Fair scheduling algorithms have been proposed to tackle the problem of bursty and location-dependent errors in wireless packet networks. Most of those algorithms ensure the fairness property and guarantee the QoS of all sessions in a large-scale cellular network such as GSM or GPRS. In this paper, we propose the Weighted-Sacrificing Fair Queueing (WSFQ) scheduling algorithm for small-area and d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015